Integration of Spatial Join Algorithms for Joining Multiple Inputs
نویسنده
چکیده
Several techniques that compute the join between two spatial datasets have been proposed during the last decade. Among these methods, some consider existing indices for the joined inputs, while others treat datasets with no index, thus providing solutions for the case where at least one input comes as an intermediate result of another database operator. In this paper we analyze previous work on spatial joins and propose a novel algorithm, called slot index spatial join (SISJ), that efficiently computes the spatial join between two inputs, only one of which is indexed by an R-tree. Going one step further, we show how SISJ and other spatial join algorithms can be implemented as operators in a database environment that joins more than two spatial inputs. We study the differences between relational and spatial multi-way joins, and propose a dynamic programming algorithm that optimizes the execution of complex spatial queries. Contact Author: Dimitris Papadias Tel: ++852-23586971 http://www.cs.ust.hk/~dimitris/ Fax: ++852-23581477 E-mail: [email protected] The Hong Kong University of Science & Technology Technical Report Series Department of Computer Science Integration of Spatial Join Algorithms for Joining Multiple Inputs Nikos Mamoulis and Dimitris Papadias Technical Report HKUST-CS98-15 November, 1998
منابع مشابه
To appear in SIGMOD 1996 1 Partition Based Spatial – Merge Join
This paper describes PBSM (Partition Based Spatial–Merge), a new algorithm for performing spatial join operation. This algorithm is especially effective when neither of the inputs to the join have an index on the joining attribute. Such a situation could arise if both inputs to the join are intermediate results in a complex query, or in a parallel environment where the inputs must be dynamicall...
متن کاملEfficient Self-Join Algorithm in Interval-based Temporal Data Models
Interval-based temporal data model is a popular data model in temporal databases. It uses time intervals for representing the period of validity of a tuple, leading to unavoidable self-joins when combining tuples for objects. It requires k + 1-way self-join for k conjunctive conditions. Join operations are one of the most expensive operations in databases and they are even more serious in tempo...
متن کاملAccelerating Spatial Join Operations using Bit-Indices
Spatial join is a very expensive operation in spatial databases. In this paper, we propose an innovative method for accelerating spatial join operations using Spatial Join Bitmap (SJB) indices. The SJB indices are used to keep track of intersecting entities in the joining data sets. We provide algorithms for constructing SJB indices and for maintaining the SJB indices when the data sets are upd...
متن کاملClone Join and Shadow Join: Two Parallel Algorithms for Executing Spatial Join Operations
With the growing popularity of spatial applications, there has been a signiicant increase in the use of database systems for storing and querying spatial data. Spatial data is now readily available from a variety of sources including government mapping agencies, commercial sources, satellite images, and simulation outputs. As this trend continues, applications continue to execute increasingly c...
متن کامل